Expected worst-case partial match in random quadtries
نویسندگان
چکیده
منابع مشابه
Expected worst-case partial match in random quadtries
We consider random multivariate quadtries obtained from n points independently and uniformly distributed on the unit cube of Rd. Let Nn(y) be the complexity of the standard partial match algorithm for fixed vector y, where y is a vector in Rs, 0 < s < d. We study Nn = supy Nn(y), the worst-case time for partial match. Among other things, we show that partial match is very stable, in the sense t...
متن کاملPartial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the data consist of independent and uniform points in the unit square. For this model, in a structure on n points, it is known that the number of nodes Cn(ξ) to visit in order to report the items matching an independent an...
متن کاملPartial match queries in random quadtrees
We propose a simple, direct approach for computing the expected cost of random partial match queries in random quadtrees. The approach gives not only an explicit expression for the leading constant in the asymptotic approximation of the expected cost but also more terms in the asymptotic expansion if desired.
متن کاملStrong Convergence of Partial Match Queries in Random Quadtrees
We prove that the rescaled costs of partial match queries in a random two-dimensional quadtree converge almost surely towards a random limit which is identified as the terminal value of a martingale. Our approach shares many similarities with the theory of self-similar fragmentations.
متن کاملA limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the data consist of independent and uniform points in the unit square. For this model, in a structure on n points, it is known that the complexity, measured as the number of nodes Cn(ξ) to visit in order to report the items ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(03)00365-2